ForestCast: A Central Solution to Heuristically Constructing Trees
نویسندگان
چکیده
The first requirement stresses that the solution needs to ensure that the actual available upload bandwidth at each node should be utilized as much as possible. Any solution must, therefore, adapt to the given upload bandwidth of the individual nodes. This implies that even nodes with petty upload bandwidth should be utilized (see Section 2.5 on multiple streams). The second requirement puts focus on latencies between the actual nodes. It also implies that the depth of the multicast trees should be shallow to minimize latencies (this is at least true given identical node latencies). Finally, the solution should continuously reconfigure the system, as there will always exist some network dynamism. By network dynamism we refer to i) nodes joining/leaving/failing, or ii) network capacity changing due to network congestion etc.
منابع مشابه
ForestCast for Peer-to-Peer Live Streaming A Solution to Heuristically Constructing Trees
Media Streaming over Internet, as a popular high bandwidth application, is an expensive service in terms of resources. An approach to reduce the cost of this service is to use peer-to-peer overlays, in which each node shares its resources with the others. Thus, the capacity of system grows by the number of participating nodes. In this thesis we present ForestCast, a peer-to-peer live media stre...
متن کاملA General Dynamic Function for the Basal Area of Individual Trees Derived from a Production Theoretically Motivated Autonomous Differential Equation
The management of forests may be motivated from production economic and environmental perspectives. The dynamically changing properties of trees affect environmental objectives and values of trees as raw material in the construction sector and in the energy sector. In order to optimize the management of forests, it is necessary to have access to reliable functions that predict how trees develop...
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملBalanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient construction of evolutionary trees: a new upper time-bound on the problem of constructing an evolutionary tree from experiments, and a relatively fast approximation algorithm for the maximum agreement subtree problem ...
متن کاملOn Central Spanning Trees of a Graph
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree of a graph is one for which the maximal distance to all other spanning trees is minimal. We prove that the problem of constructing a central spanning tree is algorithmically difficult and leads to an NP-complete problem.
متن کامل